Formation of orthogonal latin squares by index structuring of n-set multiplication tables

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly Orthogonal Latin Squares

A Latin square of order n is an n by n array in which every row and column is a permutation of a set N of n elements. Let L = [li,j ] and M = [mi,j ] be two Latin squares of even order n, based on the same N -set. Define the superposition of L onto M to be the n by n array A = (li,j ,mi,j). When n is even, L and M are said to be nearly orthogonal if the superposition of L onto M has every order...

متن کامل

‏‎suppression of coke formation in thermal cracking by coke inhibitors‎‏

‏‎the main purpose of this research was to:1.develop a coking model for thermal cracking of naphtha.2.study coke inhibition methods using different coke inhibitors.developing a coking model in naphtha cracking reactors requires a suitable model of the thermal cracking reactor based on a reliable kinetic model.to obtain reliable results all these models shall be solved simultaneously.for this pu...

15 صفحه اول

More mutually orthogonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.

متن کامل

Orthogonal latin squares of Sudoku type

Orthogonal latin squares of Sudoku type Hans-Dietrich Gronau Universität Rostock, Inst. für Mathematik 18051 Rostock, Germany We present results on the existence of orthogonal latin squares and latin rectangles of Sudoku type.

متن کامل

Enumeration of self-orthogonal Latin squares

The enumeration of self-orthogonal Latin squares (SOLS) of a given order seems to be an open problem in the literature on combinatorial designs. The existence of at least one SOLS is guaranteed for any order except 2, 3 and 6, but it is not known how many of these squares of a given order exist. In this talk we present enumeration tables of unequal SOLS, idempotent SOLS, isomorphism classes of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Herald of Dagestan State Technical University. Technical Sciences

سال: 2020

ISSN: 2542-095X,2073-6185

DOI: 10.21822/2073-6185-2020-47-3-71-81